Comparing three semantics for Linda-like languages
نویسندگان
چکیده
منابع مشابه
Comparing three semantics for Linda-like languages
A simple calculus based on generative communication is introduced; among its prim-itives, it contains a conditional input operation that tests for presence (or absence) of an output, reminiscent of the inp predicate of Linda. We study three diierent semantics for the output operation, called instantaneous, ordered and unordered, and we compare these approaches from two diierent points of view. ...
متن کاملComparing Three Semantics for Linda-like Languages1
A simple calculus based on generative communication is introduced; among its primitives, it contains a conditional input operation that tests for presence (or absence) of an output, reminiscent of the inp predicate of Linda. We study three different operational semantics for the output operation, called instantaneous, ordered and unordered. The associated behavioural semantics are obtained as t...
متن کاملSemantics and Analysis of Linda-Based Languages
In this paper we deene a process algebra abstracting relevant features of the Linda paradigm to parallel computation and show how to give it a semantics based on higher-dimensional automata which is more expressive than interleaving transition systems. In particular, it is a truly concurrent operational semantics, compositional in nature. Furthermore this semantics leads us to new kinds of abst...
متن کاملProbabilistic Linda-Based Coordination Languages
Coordination languages are intended to simplify the development of complex software systems by separating the coordination aspects of an application from its computation aspects. Coordination refers to the ways the independent active pieces of a program (e.g. a process, a task, a thread, etc.) communicate and synchronise with each other. We review various approaches to introducing probabilistic...
متن کاملA Distributed Linda-like Kernel for PVM
In this paper we describe the implementation of a Linda-like system on top of PVM. The kernel was initially developed for a Transputer based system[4]. For flexibility the system was ported to PVM. This paper outlines how the York kernel works, how it currently performs with respect to a similar system and possible future developments for the PVM version.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2000
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(99)00227-3